Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records
نویسنده
چکیده
The worst-case performance of a linear probing algorithm is studied under assumption that each of m locations can contain at most one record. It is shown that the length of the longest sequence of probes needed to insert (locate) a record grows, in probability, as c-‘log m if m and n. the total number of records, approach 03 in such a way that the load factor a = n/m is bounded away from 0 and 1, here c = a 1 log a. The argument is based on the study of the size distribution of the longest block of occupied locations. I” 1987 Academic Press. I~C
منابع مشابه
Probing the Nature of Annealing Silicon Carbide Samples for Solar Cell
SiC powder preparation using Sol-Gel method. The size of nano-particles grows as the temperature exceeds 900° C. Size of probable agglomerations produced, is approximately less than 50nm. The surface is suitable to be used for dye solar cells. SiC emission occurs at wavelength area of 11.3μm or wave number area of 884.95 cm-1. In this paper probing the nature of annealed SiC samples in mixture,...
متن کاملSimultaneous production planning and scheduling in a hybrid flow shop with time periods and work shifts
Simultaneous production planning and scheduling has been identified as one of the most important factors that affect the efficient implementation of planning and scheduling operations for the production systems. In this paper, simultaneous production planning and scheduling is applied in a hybrid flow shop environment, which has numerous applications in real industrial settings. In this problem...
متن کاملOptimizing question answering systems by Accelerated Particle Swarm Optimization (APSO)
One of the most important research areas in natural language processing is Question Answering Systems (QASs). Existing search engines, with Google at the top, have many remarkable capabilities. But there is a basic limitation (search engines do not have deduction capability), a capability which a QAS is expected to have. In this perspective, a search engine may be viewed as a semi-mechanized QA...
متن کاملAN EXPERIMENTAL INVESTIGATION OF THE SOUNDS OF SILENCE METAHEURISTIC FOR THE MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH PRE-OPTIMIZED REPERTOIRE ON THE HARDEST MMLIB+ SET
This paper presents an experimental investigation of the Sounds of Silence (SoS) harmony search metaheuristic for the multi-mode resource-constrained project scheduling problem (MRCPSP) using a pre-optimized starting repertoire. The presented algorithm is based on the time oriented version of the SoS harmony search metaheuristic developed by Csébfalvi et al. [1] for the single-mode resource-con...
متن کاملCompressed Absorbing Boundary Conditions via Matrix Probing
Absorbing layers are sometimes required to be impractically thick in order to offer an accurate approximation of an absorbing boundary condition for the Helmholtz equation in a heterogeneous medium. It is always possible to reduce an absorbing layer to an operator at the boundary by layer-stripping elimination of the exterior unknowns, but the linear algebra involved is costly. We propose to by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 8 شماره
صفحات -
تاریخ انتشار 1987